Proof Pearl: Wellfounded Induction on the Ordinals up to ε0
نویسندگان
چکیده
We discuss a proof of the wellfounded induction theorem for the ordinals up to ε0. The proof is performed on the embedding of ACL2 in HOL-4, thus providing logical justification for that embedding and supporting the claim that the ACL2 logic has a model.
منابع مشابه
Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1
We describe a comprehensive HOL mechanisation of the theory of ordinal numbers, focusing on the basic arithmetic operations. Mechanised results include the existence of fixpoints such as ε0, the existence of normal forms, and the validation of algorithms used in the ACL2 theorem-proving system.
متن کاملCovering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given structure, whereas such a formula cannot exist for ordinals themselves. The structures are precisely classified in the pushdown hierarchy. Ordinals are also located in the hierarchy, and a direct presentation is given. ...
متن کاملAdmissible Proof Theory and Beyond
Ordinals made their entrance in proof theory through Gentzen’s second consistency proof for Peano Arithmetic by transfinite induction up to ε0, the latter being applied only to decidable predicates (cf. Gentzen [1938]). Gentzen’s constructive use of ordinals as a method of analyzing formal theories has come to be a paradigm for much of proof theory from then on, particularly as exemplified in t...
متن کاملAnalytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
This paper is intended to give for a general mathematical audience (including non logicians) a survey about intriguing connections between analytic combinatorics and logic. We define the ordinals below ε0 in non-logical terms and we survey a selection of recent results about the analytic combinatorics of these ordinals. Using a versatile and flexible (logarithmic) compression technique we give ...
متن کاملA Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
We study a propositional polymodal provability logic GLP introduced by G. Japaridze. The previous treatments of this logic, due to Japaridze and Ignatiev (see [11, 7]), heavily relied on some non-finitary principles such as transfinite induction up to ε0 or reflection principles. In fact, the closed fragment of GLP gives rise to a natural system of ordinal notation for ε0 that was used in [1] f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007